package com.cqs.leetcode.ds.union.find;

public interface IUnionFind {


    int find(int p);

    void union(int p, int q);

    int count();

    boolean connected(int p,int q);
}
